Capacity achieving code constructions for two classes of (d,k) constraints
نویسندگان
چکیده
منابع مشابه
cient Code Constructions for Certain Two Dimensional Constraints �
E cient encoding algorithms are presented for two types of constraints on two dimensional binary arrays The rst constraint considered is that of t conservative arrays where each row and each column has at least t transitions of the form or The second constraint is that of two dimensional DC free arrays where in each row and each column the number of s equals the number of s
متن کاملNear-capacity fixed-rate and rateless channel code constructions
Near-Capacity Fixed-Rate and Rateless Channel Code Constructions
متن کاملTwo Approaches for Achieving Efficient Code-Based Cryptosystems
Code-based cryptography (CBC) is one of the most prominent post-quantum alternatives to conventional cryptography. Although quantumresistant and several times faster than its conventional counterparts, CBC is not widely deployed in practice. This is mostly due to its huge public-key sizes of several kilobytes. In this thesis, two different approaches to overcome this problem are introduced. One...
متن کاملCategorical Code Constructions
We study categories of codes and precodes. The objects in these categories capture the encoding and decoding process of error control codes, source codes, or cryptographic codes. We show that these categories are complete and cocomplete. This gives a wealth of new code constructions.
متن کاملOptimal Subsystem Code Constructions
In this paper, a generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. Furthermore, a simple construction of pure MDS subsystem codes is obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.876224